18,735 research outputs found

    An improved kernel for the cycle contraction problem

    Full text link
    The problem of modifying a given graph to satisfy certain properties has been one of the central topics in parameterized tractability study. In this paper, we study the cycle contraction problem, which makes a graph into a cycle by edge contractions. The problem has been studied {by Belmonte et al. [IPEC 2013]} who obtained a linear kernel with at most 6k+66k+6 vertices. We provide an improved kernel with at most 5k+45k+4 vertices for it in this paper.Comment: 12 pages, 3 figure

    AUC-maximized Deep Convolutional Neural Fields for Sequence Labeling

    Full text link
    Deep Convolutional Neural Networks (DCNN) has shown excellent performance in a variety of machine learning tasks. This manuscript presents Deep Convolutional Neural Fields (DeepCNF), a combination of DCNN with Conditional Random Field (CRF), for sequence labeling with highly imbalanced label distribution. The widely-used training methods, such as maximum-likelihood and maximum labelwise accuracy, do not work well on highly imbalanced data. To handle this, we present a new training algorithm called maximum-AUC for DeepCNF. That is, we train DeepCNF by directly maximizing the empirical Area Under the ROC Curve (AUC), which is an unbiased measurement for imbalanced data. To fulfill this, we formulate AUC in a pairwise ranking framework, approximate it by a polynomial function and then apply a gradient-based procedure to optimize it. We then test our AUC-maximized DeepCNF on three very different protein sequence labeling tasks: solvent accessibility prediction, 8-state secondary structure prediction, and disorder prediction. Our experimental results confirm that maximum-AUC greatly outperforms the other two training methods on 8-state secondary structure prediction and disorder prediction since their label distributions are highly imbalanced and also have similar performance as the other two training methods on the solvent accessibility prediction problem which has three equally-distributed labels. Furthermore, our experimental results also show that our AUC-trained DeepCNF models greatly outperform existing popular predictors of these three tasks.Comment: Under review as a conference paper at ICLR 201

    EMM: Energy-Aware Mobility Management for Mobile Edge Computing in Ultra Dense Networks

    Full text link
    Merging mobile edge computing (MEC) functionality with the dense deployment of base stations (BSs) provides enormous benefits such as a real proximity, low latency access to computing resources. However, the envisioned integration creates many new challenges, among which mobility management (MM) is a critical one. Simply applying existing radio access oriented MM schemes leads to poor performance mainly due to the co-provisioning of radio access and computing services of the MEC-enabled BSs. In this paper, we develop a novel user-centric energy-aware mobility management (EMM) scheme, in order to optimize the delay due to both radio access and computation, under the long-term energy consumption constraint of the user. Based on Lyapunov optimization and multi-armed bandit theories, EMM works in an online fashion without future system state information, and effectively handles the imperfect system state information. Theoretical analysis explicitly takes radio handover and computation migration cost into consideration and proves a bounded deviation on both the delay performance and energy consumption compared to the oracle solution with exact and complete future system information. The proposed algorithm also effectively handles the scenario in which candidate BSs randomly switch on/off during the offloading process of a task. Simulations show that the proposed algorithms can achieve close-to-optimal delay performance while satisfying the user energy consumption constraint.Comment: 14 pages, 6 figures, an extended version of the paper submitted to IEEE JSA

    Hyperspectral Unmixing with Endmember Variability using Semi-supervised Partial Membership Latent Dirichlet Allocation

    Full text link
    A semi-supervised Partial Membership Latent Dirichlet Allocation approach is developed for hyperspectral unmixing and endmember estimation while accounting for spectral variability and spatial information. Partial Membership Latent Dirichlet Allocation is an effective approach for spectral unmixing while representing spectral variability and leveraging spatial information. In this work, we extend Partial Membership Latent Dirichlet Allocation to incorporate any available (imprecise) label information to help guide unmixing. Experimental results on two hyperspectral datasets show that the proposed semi-supervised PM-LDA can yield improved hyperspectral unmixing and endmember estimation results

    The LFV decays of Z boson in Minimal R-symmetric Supersymmetric Standard Model

    Full text link
    A future ZZ-factory will offer the possibility to study rare ZZ decays Z→l1l2Z\rightarrow l_1l_2, as those leading to Lepton Flavor Violation final states. In this work, by taking account of the constraints from radiative two body decays l2→l1γl_2\rightarrow l_1\gamma, we investigate the Lepton Flavor Violation decays Z→l1l2Z\rightarrow l_1l_2 in the framework of Minimal R-symmetric Supersymmetric Standard Model with two benchmark points from already existing literatures. The flavor violating off-diagonal entries δ12\delta^{12}, δ13\delta^{13} and δ23\delta^{23} are constrained by the current experimental bounds of l2→l1γl_2\rightarrow l_1\gamma. Considering recent experimental constraints, we also investigate Br(Z→l1l2Z\rightarrow l_1l_2) as a function of MDWM_D^W. The numerical results show that the theoretical prediction of Br(Z→l1l2Z\rightarrow l_1l_2) in MRSSM are several orders of magnitude below the current experimental bounds. The Lepton Flavor Violation decays Z→eτZ\rightarrow e\tau and Z→μτZ\rightarrow \mu\tau may be promising to be observed in future experiment.Comment: 17pages,8 figures,8 tables,to be published in Chinese Physics

    Families of K3 surfaces over curves satisfying the equality of Arakelov-Yau's type and modularity

    Full text link
    Let f:Xβ†’Cf:X\to C be a family of semistable K3 surfaces with non-empty set SS of singular fibres having infinite local monodromy. Then, when the so called Arakelov-Yau inequality reaches equality, we prove that Cβˆ–SC\setminus S is a modular curve and the family comes essentially from a family of elliptic curves through a so called Nikulin-Kummer construction. In particular, when C=\BBb P^1, the family of elliptic curves must be one of Beauville's 6 examples where Arakelov inequality reaches equality.Comment: 18 pages, Late

    Spin-Orientation Dependent Topological States in Two-Dimensional Antiferromagnetic NiTl2_2S4_4 Monolayers

    Full text link
    The topological states of matters arising from the nontrivial magnetic configuration provide a better understanding of physical properties and functionalities of solid materials. Such studies benefit from the active control of spin orientation in any solid, which is yet known to rarely take place in the two-dimensional (2D) limit. Here we demonstrate by the first-principles calculations that spin-orientation dependent topological states can appear in the geometrically frustrated monolayer antiferromagnet. Different topological states including quantum anomalous Hall (QAH) effect and time-reversal-symmetry (TRS) broken quantum spin Hall (QSH) effect can be obtained by changing spin orientation in the NiTl2S4 monolayer. Remarkably, the dilated nc-AFM NiTl2S4 monolayer gives birth to the QAH effect with hitherto reported largest number of quantized conducting channels (Chern number C = -4) in 2D materials. Interestingly, under tunable chemical potential, the nc-AFM NiTl2S4 monolayer hosts a novel state supporting the coexistence of QAH and TRS broken QSH effects with a Chern number C = 3 and spin Chern number C_s = 1. This work manifests a promising concept and material realization toward topological spintronics in 2D antiferromagnets by manipulating its spin degree of freedom

    Computations of superstring amplitudes in pure spinor formalism via Cadabra

    Full text link
    The discovery of pure spinor formalism makes the computation of superstring scattering amplitudes possible. In this paper, we will illustrate how computer algebra system Cadabra is used in computing the supersymmetric amplitude in pure spinor formalism and provide the source code that computes the tree-level massless 5-gluon amplitude.Comment: 23 pages,3 figure.v1-v5:comments are added, several mistakes are corrected, some references are adde

    Predicting diverse M-best protein contact maps

    Full text link
    Protein contacts contain important information for protein structure and functional study, but contact prediction from sequence information remains very challenging. Recently evolutionary coupling (EC) analysis, which predicts contacts by detecting co-evolved residues (or columns) in a multiple sequence alignment (MSA), has made good progress due to better statistical assessment techniques and high-throughput sequencing. Existing EC analysis methods predict only a single contact map for a given protein, which may have low accuracy especially when the protein under prediction does not have a large number of sequence homologs. Analogous to ab initio folding that usually predicts a few possible 3D models for a given protein sequence, this paper presents a novel structure learning method that can predict a set of diverse contact maps for a given protein sequence, in which the best solution usually has much better accuracy than the first one. Our experimental tests show that for many test proteins, the best out of 5 solutions generated by our method has accuracy at least 0.1 better than the first one when the top L/5 or L/10 (L is the sequence length) predicted long-range contacts are evaluated, especially for protein families with a small number of sequence homologs. Our best solutions also have better quality than those generated by the two popular EC methods Evfold and PSICOV.Comment: Accepted as oral presentation at Computational Structural Bioinformatics Workshop (In Conjunction With IEEE BIBM 2015

    Non-Abelian Self-Dual String Solutions

    Full text link
    We consider the equations of motion of the non-abelian 5-branes theory recently constructed in http://arxiv.org/abs/arXiv:1203.4224 and find exact string solutions both for uncompactified and compactified spacetime. Although one does not have the full supersymmetric construction of the non-abelian (2,0) theory, by combining knowledge of conformal symmetry and R-symmetry one can argue for the form of the 1/2 BPS equations in the case when only one scalar field is turned on. We solve this system and show that our string solutions could be lifted to become solutions of the non-abelian (2,0) theory with self-dual electric and magnetic charges, with the scalar field describing a M2-brane spike emerging out of the multiple M5-branes worldvolume.Comment: 22 pages. LaTeX. 2 figure
    • …
    corecore